A Novel Cache Distribution HeuristicAlgorithm for a Mesh of Caches and ItsPerformance

نویسندگان

  • Jorge Escorcia
  • Dipak Ghosal
  • Dilip Sarkar
چکیده

The widespread use of the Internet has created two problems: document retrieval latency and network traac. Caching of documents \close" to users has helped to alleviate both problems. Diierent caching policies have been proposed/implemented to make best use of limited available cache at each caching server. A mesh of caching servers, aided by diierent data diiusion algorithms and the natural hierarchical structure of the Internet topology, has increased \virtual" size of cache. Yet the size of available cache is small compared to the total size of all documents served, and remains a major resource constraint. In this work, we looked at how to improve document download time, by distributing a xed amount of total storage in a network or mesh of caches. The intuition behind our cache distribution approach is to give more storage to the caching nodes in the network which experience more traac, in the hopes that this will reduce the average latency of document retrieval in the network. A heuristic was developed to estimate traac at each cache of a network. From this traac estimation, each cache then receives a corresponding percentage of the total storage capacity of the network. Through extensive simulation it is found that the proposed cache distribution algorithm can reduce latency up to 80% over prior work that includes both Harvest-type and demand-driven data diiusion algorithms. Furthermore, the best improvement was achieved in a cache range that corresponds to practical, real world cache ranges. 2

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Study of Satellite-Linked Web Caches and Filtering Policies

The exponential growth of World-Wide Web (WWW) requires new and more efficient content distribution mechanisms. Web caching has shown to be a very efficient way to scale the WWW by reducing traffic in congested network links, decreasing latency to the clients, and reducing load in the origin servers. In this paper we study an emerging caching strategy called cache-satellite distribution. In a c...

متن کامل

Bringing the Web to the Network Edge: Large Caches and Satellite Distribution

In this paper we discuss the performance of a Web caching distribution where caches are interconnected through a satellite channel. Web caching is emerging as an important way to reduce client-perceived latency and network resource requirements in the Internet. A satellite distribution is being extensively deployed to offer broadcast services avoiding highly congested terrestrial links. When a ...

متن کامل

Locality-oblivious cache organization leveraging single- cycle multi-hop NoCs Citation

Locality has always been a critical factor in on-chip data placement on CMPs as accessing further-away caches has in the past been more costly than accessing nearby ones. Substantial research on locality-aware designs have thus focused on keeping a copy of the data private. However, this complicates the problem of data tracking and search/invalidation; tracking the state of a line at all on-chi...

متن کامل

Cache-aware Parallel Programming for Manycore Processors

With rapidly evolving technology, multicore and manycore processors have emerged as promising architectures to benefit from increasing transistor numbers. The transition towards these parallel architectures makes today an exciting time to investigate challenges in parallel computing. The TILEPro64 is a manycore accelerator, composed of 64 tiles interconnected via multiple 8×8 mesh networks. It ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002